Sufficient Conditions for First-Order and Datalog Rewritability in ELU
نویسندگان
چکیده
We study the problem of answering instance queries over non-Horn ontologies by rewriting them into Datalog programs or FirstOrder queries (FOQs). We consider the basic non-Horn language ELU , which extends EL with disjunctions. Both Datalog-rewritability and FOrewritability of instance queries have been recently shown to be decidable for ALC ontologies (and hence also for ELU); however, existing decision methods are mainly of theoretical interest. We identify two fragments of ELU for which we can compute Datalog-rewritings and FO-rewritings of instance queries, respectively, by means of a resolution-based algorithm.
منابع مشابه
Ontology-Mediated Querying with EL: Trichotomy and Linear Datalog Rewritability
We consider ontology-mediated queries (OMQs) based on an EL ontology and an atomic query (AQ), provide an ultimately finegrained analysis of data complexity and study rewritability into linear Datalog – aiming to capture linear recursion in SQL. Our main results are that every such OMQ is in AC0, NL-complete or PTime-complete, and that containment in NL coincides with rewritability into linear ...
متن کاملOntology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability
We consider ontology-mediated queries (OMQs) based on an EL ontology and an atomic query (AQ), provide an ultimately fine-grained analysis of data complexity and study rewritability into linear Datalog– aiming to capture linear recursion in SQL. Our main results are that every such OMQ is in AC0, NL-complete or PTIME-complete, and that containment in NL coincides with rewritability into linear ...
متن کاملRewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics∗
We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are decidable, and that rewritability into Datalog is decidable when the original query satisfies a certa...
متن کاملRewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk)
We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are decidable, and that rewritability into Datalog is decidable when the original query satisfies a certa...
متن کاملUpdating DL-Lite Ontologies Through First-Order Queries
In this paper we study instance-level update in DL-LiteA, the description logic underlying the owl 2 ql standard. In particular we focus on formula-based approaches to ABox insertion and deletion. We show that DL-LiteA, which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for updates. That is, every update can be reformu...
متن کامل